Adversarial Turing Patterns from Cellular Automata
نویسندگان
چکیده
State-of-the-art deep classifiers are intriguingly vulnerable to universal adversarial perturbations: single disturbances of small magnitude that lead misclassification most inputs. This phenomena may potentially result in a serious security problem. Despite the extensive research this area, there is lack theoretical understanding structure these perturbations. In image domain, certain visual similarity between patterns, represent perturbations, and classical Turing which appear as solution non-linear partial differential equations underlying concept many processes nature. paper, we provide bridge two different theories, by mapping simplified algorithm for crafting perturbations (inhomogeneous) cellular automata, latter known generate patterns. Furthermore, propose use generated experimentally show they significantly degrade performance learning models. We found method be fast efficient way create data-agnostic quasi-imperceptible perturbation black-box scenario. The source code available at https://github.com/NurislamT/advTuring.
منابع مشابه
Turing Patterns, Cellular Automata, Tilings and Op-Art
I provide a brief survey documenting the inclusion of cellular automata, periodic tilings and op-art in mathematical art. Then I give an overview of the history of Turing-like patterns in mathematical art. I describe a cellular automaton for producing Turing-like patterns and introduce some new variations. This leads to an open problem concerning the convergence of such patterns. Turing and Tur...
متن کاملTuring Degrees of Limit Sets of Cellular Automata
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one step further in this article by giving a full characterization of the sets of T...
متن کاملAtlas of Patterns from One-rule Firing Cellular Automata
Growing cellular automata (CA) can generate diverse patterns such as flowers and snow crystals, especially when one-rule firing scheme is employed. In the present paper, hexagonal CAs on 2D plane is used to investigate the patterns generated under the one-rule firing scheme. Rules define the state of an empty cell in the next time-step as a function of the present states of its six neighborhood...
متن کاملQuantum Turing automata
A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces. Using the Moore-Penrose generalized inverse, a new additive trace is introduced on the restriction of this category to isometries, which trace is carried over to directed quantum Turing machines as monoidal automata. The JoyalStreet-...
متن کاملGrowing Patterns in One Dimensional Cellular Automata
We st udy limi t evolut ions of cellular automata (CA) both theoretically and exp erimentally. We show that eit her all orbits ente r the limit set after less than a finit ely bo unded number of states, or almost all orbits never ent er the limit set . We link this result with a class ification of CAs according to their limit behavior due to Culik et al.: in t he first case, the considered CA b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i3.16372